Some Possibility and Impossibility Results related to Discrete Fourier type transforms in Quantum Information
نویسنده
چکیده
Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more generalization, we investigate the possibility and impossibility results related to Discrete Fourier Transform (DFT) type of operations for a more general set up of qutrits.
منابع مشابه
Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملOn the Irresistible Efficiency of Signal Processing Methods in Quantum Computing
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log N) elementary quantum gates are necessary to i...
متن کاملA Survey of Finite Algebraic Geometrical Structures Underlying Mutually Unbiased Quantum Measurements
The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are reviewed and an emerging link between them is outlined. It is shown that these methods employ a wide range of important mathematical concepts like, e.g., Fourier transforms, Galois fields and rings, finite and related projective geometries, and entanglement, to mention...
متن کاملLarge quantum Fourier transforms are never exactly realized by braiding conformal blocks
Fourier transform is an essential ingredient in Shor’s factoring algorithm. In the standard quantum circuit model with the gate set U 2 , controlled-NOT , the discrete Fourier transforms FN= ij N N, i , j=0,1 ,... ,N −1, =e2 i/N, can be realized exactly by quantum circuits of size O n2 , n=ln N, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest un...
متن کاملQuantum fast Fourier transform using multilevel atoms
We propose an implementation of the quantum fast Fourier transform algorithm in an entangled system of multilevel atoms. The Fourier transform occurs naturally in the unitary time evolution of energy eigenstates and is used to de®ne an alternative wave-packet basis for quantum information in the atom. A change of basis from energy levels to wave packets amounts to a discrete quantum Fourier tra...
متن کامل